Self-Stabilizing Neighborhood Synchronizer in Tree Networks
نویسندگان
چکیده
We propose a self-stabilizing synchronization technique, called the Neighborhood Synchronizer (NS), that synchronizes nodes with their neighbors in a tree network. The NS scheme has extremely small memory requirement— only 1 bit per processor. Algorithm NS is inherently selfstabilizing. We apply our synchronizer to design a broadcasting algorithm BA in tree networks. Algorithm BA is also inherently self-stabilizing and needs only 2h+2m 1 rounds to broadcast m messages, where h is the height of the tree.
منابع مشابه
Self-Stabilization with Global Rooted Synchronizers
We propose a self-stabilizing synchronization technique, called the Global Rooted Synchronization, that synchronizes processors in a tree network. This synchronizer converts a synchronous protocol for tree networks into a self-stabilizing version. The synchronizer requires only O(1) memory (other than the memory needed to maintain the tree) at each node regardless of the size of the network, st...
متن کاملState-optimal snap-stabilizing PIF in tree networks
In this paper, we introduce the notion of snapstabilization. A snap-stabilizing algorithm protocol guarantees that, starting from an arbitrary system configuration, the protocol always behaves according to its specification. So, a snap-stabilizing protocol is a self-stabilizing protocol which stabilizes in 0 steps. We propose a snap-stabilizing Propagation of Information with Feedback (PIF) sch...
متن کاملA Stabilizing Rendition of MST Construction
A self-stabilizing construction of the minimum-spanning forest of distributed network is described. The algorithm demonstrates that techniques of graph reduction and iteration can be employed in the context of stabilizing distributed programs. The program development follows the principle of layering in the construction of self-stabilizing algorithms, where each layer corresponds to one level o...
متن کاملSize-Independent Self-Stabilizing Asynchronous Phase Synchronization in General Graphs
In this paper, we design a self-stabilizing phase synchronizer for distributed systems. The synchronizer enables a node transfer from one phase to the next one, subject to the condition that at most two consecutive phases can appear among all nodes. It does not rely on any system parameter like the number of nodes, and is thus fit for the system with dynamically changing number of nodes. Each n...
متن کاملGuest Editorial Self - Stabilizing Systems , Part 2
In the Fall of 2002, Joffroy Beauquier and Colette Johnen (at the Université Paris-Sud) organized an International Seminar on Self-Stabilization at Luminy, France. The seminar, which was sponsored by the Centre International de Rencontres Mathématiques, was a great success uncovering new research directions concerning the self-stabilization of network protocols and distributed systems. As it ha...
متن کامل